Evaluation of Matrix Multiplication on an MPI Cluster
نویسندگان
چکیده
An mpi cl uste r is a group of compute rs whi ch are l oosel y conne cte d toge the r to provi de fast and reli able se rvi ce s . Cluste rs use i n many scie ntifi c computing, such as the matri x mul ti pl i cati on. O ur expe ri ment i s base d on the maste r – sl ave mode l i n homogenous compute rs to compute the pe rformance of e xpe ri ment. We compute the e xe cuti on time for many exampl es to compute the spee d up. The de velope d pe rformance model has been che cke d and it has bee n shown that the parallel model i s fas te r than the se ri al model and the computa ti on ti me was
منابع مشابه
Performance Evaluation of Parallel Applications using MPI in Cluster Based Parallel Computing Architecture
Parallel computing operates on the principle that large problems can often be divided into smaller ones, which are then solved concurrently to save time (wall clock time) by taking advantage of non-local resources and overcoming memory constraints. The main aim is to form a cluster based parallel computing architecture for MPI based applications which demonstrates the performance gain and losse...
متن کاملOn Benchmarking the Matrix Multiplication Algorithm using OpenMP, MPI and CUDA Programming Languages
Parallel programming languages represent a common theme in the evolution of high performance computing (HPC) systems. There are several parallel programming languages that are directly associated with different HPC systems. In this paper, we compare the performance of three commonly used parallel programming languages, namely: OpenMP, MPI and CUDA. Our performance evaluation of these languages ...
متن کاملReducing Inter-Process Communication Overhead in Parallel Sparse Matrix-Matrix Multiplication
Parallel sparse matrix-matrix multiplication algorithms (PSpGEMM) spend most of their running time on interprocess communication. In the case of distributed matrix-matrix multiplications, much of this time is spent on interchanging the partial results that are needed to calculate the final product matrix. This overhead can be reduced with a one dimensional distributed algorithm for parallel spa...
متن کاملPerformance Analysis of Overheads for Matrix - Vector Multiplication in Cluster Environment
This paper presents the basic parallel implementation and a variation for matrix vector multiplication. We evaluated and compared the performance of the two implementations on a cluster of workstations using Message Passing Interface (MPI) library. The experimental results demonstrate that the basic implementation achieves lower performance than the other variation. Further, we analyzed the sev...
متن کاملThreaded MPI programming model for the Epiphany RISC array processor
The low-power Adapteva Epiphany RISC array processor offers high computational energy-efficiency and parallel scalability. However, extracting performance with a standard parallel programming model remains a great challenge. We present an effective programming model for the Epiphany architecture basedon theMessagePassing Interface (MPI) standardadapted for coprocessoroffload.UsingMPIexploits th...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013